Data reuse algorithm for multiple reference frame motion estimation
نویسندگان
چکیده
A data reuse algorithm for multiple reference frame motion estimation is described. The proposed algorithm reduces memory access by modifying the reference frame search order and search centre such that the likelihood of data reuse is increased. Experimental results show that the algorithm reduces memory access by 15–30% compared to the conventional fast reference frame selection algorithm, while maintaining similar bit rate and PSNR.
منابع مشابه
High-Performance Motion Estimation for Image Sensors with Video Compression
It is important to reduce the time cost of video compression for image sensors in video sensor network. Motion estimation (ME) is the most time-consuming part in video compression. Previous work on ME exploited intra-frame data reuse in a reference frame to improve the time efficiency but neglected inter-frame data reuse. We propose a novel inter-frame data reuse scheme which can exploit both i...
متن کاملAn Efficient Motion Multiple Reference F
The H.264/AVC coding standard allows more than one decoded frame reference frames to make full use of reducing temporal redundancy in a video sequence. However, motion estimation in multiple frames introduces tremendous computational complexity. This paper presents a fast full search motion estimation algorithm for multiple reference frame motion estimation. The proposed method can be applied t...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملReliable tracking algorithm for multiple reference frame motion estimation
Multiple reference frame motion estimation (MRF-ME) is one of the most crucial tools in H.264/AVC to improve coding efficiency. However, it disciplines an encoder by giving extra computational complexity. The required computation proportionally expands when the number of reference frames used for motion estimation increases. Aiming to reduce the computational complexity of the encoder, various ...
متن کاملSteinbach, Wiegand, Girod: Using Multiple Global Motion Models for Improved Block-Based Video Coding, in Proc. ICIP'99 USING MULTIPLE GLOBAL MOTION MODELS FOR IMPROVED BLOCK-BASED VIDEO CODING
A novel motion representation and estimation scheme is presented that leads to improved coding e ciency of blockbased video coders like, e.g., H.263. The proposed scheme is based on motion-compensated prediction from more than one reference frame. The reference pictures are warped or globally motion-compensated versions of the previous frame. A ne motion models are used as warping parameters ap...
متن کامل